On doing Todd-Coxeter coset enumeration in parallel
نویسندگان
چکیده
منابع مشابه
On doing Todd-Coxeter enumeration in parallel*
Akl, S., G. Laborite, M. Leeder and K. Qiu, On doing Todd-Coxeter coset enumeration in parallel, Discrete Applied Mathematics 34 (1991) 27-35. The Todd-Coxeter coset enumeration method is without any doubt the best known and most used method in computational group theory. Surprisingly, however, it seems that no attempt has yet been made at producing a parallel version of it. This paper reports ...
متن کاملParallel Coset Enumeration Using Threads
Coset enumeration is one of the basic tools for investigating nitely presented groups. Many enumerations require signiicant resources, in terms of CPU time or memory space. We develop a fully functional parallel coset enumeration procedure and we discuss some of the issues involved in such parallelisation using the POSIX threads library. Our results can equally well be applied to any master-sla...
متن کاملObservations on Coset Enumeration
Todd and Coxeter's method for enumerating cosets of nitely generated subgroups in nitely presented groups (abbreviated by Tc here) is one famous method from combinatorial group theory for studying the subgroup problem. Since preex string rewriting is also an appropriate method to study this problem, preex string rewriting methods have been compared to Tc. We recall and compare two of them briee...
متن کاملExperiments in Coset Enumeration
Coset enumeration, based on the methods described by Todd and Coxeter, is one of the most important tools for investigating nitely presented groups. Such methods do not, in general, constitute an algorithm. Each problem has to be addressed individually, and determining whether or not an acceptable solution for a diicult problem can be found using given resources requires an empirical approach (...
متن کاملConstructing Matrix Representations of Finitely Presented Groups
The Todd-Coxeter coset enumeration algorithm is one of the most powerful tools of computational group theory. It may be viewed as a means of constructing permutation representations of nitely presented groups. In this paper we present an analogous algorithm for directly constructing matrix representations over many elds. In fact the algorithm is more general than this, and can be used to constr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1991
ISSN: 0166-218X
DOI: 10.1016/0166-218x(91)90076-9